public class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int t;
        for(int i=0;i<numbers.length;i++){
            t = target-numbers[i];
            numbers[i]=0;
            int r = Arrays.binarySearch(numbers,t);
            if(r>0){
                return new int[]{i+1,r+1};
            }
        }
        return new int[]{0,0};
    }
}